Pruning Algorithms for Pretropisms of Newton Polytopes
نویسندگان
چکیده
Pretropisms are candidates for the leading exponents of Puiseux series that represent positive dimensional solution sets of polynomial systems. We propose a new algorithm to both horizontally and vertically prune the tree of edges of a tuple of Newton polytopes. We provide experimental results with our preliminary implementation in Sage that demonstrates that our algorithm compares favorably to the definitional algorithm.
منابع مشابه
Exact Gift Wrapping to Prune the Tree of Edges of Newton Polytopes to Compute Pretropisms
Pretropisms are candidates for the leading exponents of Puiseux series that represent solutions of polynomial systems. To find pretropisms, we propose an exact gift wrapping algorithm to prune the tree of edges of a tuple of Newton polytopes. We prefer exact arithmetic not only because of the exact input and the degrees of the output, but because of the often unpredictable growth of the coordin...
متن کاملPolyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem
We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Puiseux series expansion. The leading powers of the series are computed via the tropical prevariety. This polyhedral algorithm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initia...
متن کاملComputing Pretropisms for the Cyclic n-Roots Problem
The cyclic n-roots problem is an important benchmark problem for polynomial system solvers. We consider the pruning of cone intersections for a polyhedral method to compute series for the solution curves.
متن کاملDecomposition of Polytopes and Polynomials
Motivated by a connection with the factorization of multivariable polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algori...
متن کاملEinladung Im Oberseminar Reelle Geometrie Und Algebra Hält Coercive Polynomials and Their Newton Polytopes
Many interesting properties of polynomials are closely related to the geometry of their Newton polytopes. We analyze the coercivity on R of multivariate polynomials f ∈ R[x] in terms of their Newton polytopes. In fact, we introduce the broad class of so-called gem regular polynomials and characterize their coercivity via conditions imposed on the vertex set of their Newton polytopes. These cond...
متن کامل